perm filename LETTER.AE[LSP,JRA]1 blob
sn#129971 filedate 1974-11-11 generic text, type C, neo UTF8
COMMENT ⊗ VALID 00002 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00002 00002 \\M1BASL30\M2BASB30\M3NGR25\M4NGR20\F2\CSTANFORD UNIVERSITY
C00010 ENDMK
C⊗;
\\M1BASL30;\M2BASB30;\M3NGR25;\M4NGR20;\F2\CSTANFORD UNIVERSITY
\F3\CSTANFORD, CALIFORNIA 94305
\F4COMPUTER SCIENCE DEPARTMENT\←L\-R\/'7;\+R\→.\→S Telephone:
\←S\→.415-497-4971
\F1\CNov 11, 1974
Blake E. Vance, Assistant to the President
American Elsevier Publishing Co., Inc.
52 Vanderbilt Ave.
New York, N.Y. 10017
Dear Mr. Vance:
\JI am enclosing two copies of my manuscript along with cover letters
explaining the revisions and additions that I plan to make.
These changes have been worked out in detail during my lectures at
UC Santa Cruz, so I forsee no difficulties in incorporating them.
Due to other projects I will not be able to produce the revised
version for a few more weeks, but the current manuscript with the "apology"
should express my intentions.
Let me give you a slight introduction to the manuscript. It grew out
of a course on data structures I developed at UCLA. I expanded and
revised the notes here at Stanford, and have taught variants at the
UC Santa Cruz graduate workshop the last two years. I will be helping
San Jose State set up their graduate data structures courses next
semester and will use the manuscript there. A few students in
Stanford's CS206 course used it, and students of Tony Hearn at Utah
are currently using it.
The manuscript will attempt to be self-contained because I think LISP
is the best way to introduce prospective students to the field. The
fewer preconceptions about programming languages, the better. Thus
the book goes from very basic undergraduate material to current
research in semantics. The material on λ-calculus and Scott's models
is currently very rudimentary. I am attempting to develop an
intuitive introduction to these areas.
Basically the material falls into 5 areas:
\F21.\F1 The mechanics of the
language; recursion, functional arguments. Representation of
algorithms in a programming language, representation of domains as
data structures.
\F22.\F1 Evaluation; the importance of interpretation and
its relation to denotational models.
\F23.\F1 Implementation of the static structure of LISP and the
problems of machine orgainzation.
\F24.\F1 The dynamic structure of LISP and compilers for LISP; LISP, being
a very clean way to introduce compilation.
\F25.\F1 Implications for
language design; given a clear understanding of LISP, what can be
done better. This comes from my own ideas on a LISP-like language
with user-defined data structures and a semantics which is more
amenable to proofs and verifications.
My writing style is informal, but I do not want to appear flippant or
be imprecise; either of these faults is deadly. Two reviewers objected
to the style; six made explicit positive comments.
Now, the state of the manuscript. Parts (1), (2), and (5) are in
reasonable shape; perhaps 80% complete. Part (3) perhaps 50%;
implementation without machines is unsettling for many students, but
so much is irrelevant. I tried graphical methods the last time, but
...; Part (4), on compilers, perhaps 70% completed.
The reviews have been quite favorable, and I am convinced that the
manuscript should be published. LISP is the most most poorly
understood programming language around, and it gets a little tiresome
to see people re-inventing McCarthy's ideas simply because there's no
decent documentation. There's a succinct statement by Strachey which
I think represents position and the current stateof affairs: "I
always worked on programming languages because it seems to me until
you could understand those, you couldn't understand computers.
Understanding them doesn't really mean only being able to use them. A
lot of people can use them without understanding them." This quote
goes at the beginning of the chapter on evaluation!
Dr. Nilsson suggested that I mention possible reviewers.
Dr. J. S. Moore of the Xerox Research Labs, has reviewed a prior
version of the manuscript and made valuable suggestions on improving
the presentation. He is willing to review this later version.
\.
\←L\→S\←R\-L\/'2;\+L\→L
Yours sincerely,
John R. Allen
Research Associate
Computer Science Dept
Artificial Intelligence Labs
\←S\→L